Quasi-Newton’s method for multiobjective optimization

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasi-Newton Methods for Nonconvex Constrained Multiobjective Optimization

Here, a quasi-Newton algorithm for constrained multiobjective optimization is proposed. Under suitable assumptions, global convergence of the algorithm is established.

متن کامل

Newton's Method for Multiobjective Optimization

We propose an extension of Newton’s Method for unconstrained multiobjective optimization (multicriteria optimization). The method does not scalarize the original vector optimization problem, i.e. we do not make use of any of the classical techniques that transform a multiobjective problem into a family of standard optimization problems. Neither ordering information nor weighting factors for the...

متن کامل

Multiobjective fuzzy optimization method

1 Technical University of Cluj-Napoca Abstract -The paper proposes a new multiobjective optimization method, based on fuzzy techniques. The method performs a real multiobjective optimization, every parameter modification taking into account the unfulfillment degrees of all the requirements. It uses fuzzy sets to define fuzzy objectives and fuzzy systems to compute new parameter values. The stra...

متن کامل

Adaptive Weighted Sum Method for Multiobjective Optimization

This paper presents an adaptive weighted sum method for multiobjective optimization problems. The authors developed the bi-objective adaptive weighted sum method, which determines uniformly-spaced Pareto optimal solutions, finds solutions on non-convex regions, and neglects non-Pareto optimal solutions. However, the method could solve only problems with two objective functions. In this work, th...

متن کامل

An Adaptive Scalarization Method in Multiobjective Optimization

This paper presents a new method for the numerical solution of nonlinear multiobjective optimization problems with an arbitrary partial ordering in the objective space induced by a closed pointed convex cone. This algorithm is based on the well-known scalarization approach by Pascoletti and Serafini and adaptively controls the scalarization parameters using new sensitivity results. The computed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2014

ISSN: 0377-0427

DOI: 10.1016/j.cam.2013.06.045